Communication and Data Sharing for Dynamic Distributed Systems
Identifieur interne : 007A87 ( Main/Exploration ); précédent : 007A86; suivant : 007A88Communication and Data Sharing for Dynamic Distributed Systems
Auteurs : Nancy Lynch [États-Unis] ; Alex Shvartsman [États-Unis]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This research direction aims to develop and analyze algorithms to solve problems of communication and data sharing in highly dynamic distributed environments. The term dynamic here encompasses many types of changes, including changing network topology, processor mobility, changing sets of participating client processes, a wide range of types of processor and network failures, and timing variations. Constructing distributed applications for such environments is a difficult programming problem. In practice, considerable effort is required to make applications resilient to changes in client requirements and to evolution of the underlying computing medium. We focus our work on distributed services that provide useful guarantees and that make the construction of sophisticated distributed applications easier. The properties we study include ordering and reliability guarantees for communication and coherence guarantees for data sharing. To describe inherent limitations on what problems can be solved, and at what cost, the algorithmic results will be accompanied by lower bound and impossibility results. One example of our approach is the new dynamic atomic shared-memory service for message-passing systems. We formally specified the service and developed algorithms implementing the service. A system implementation is under development. The service is reconfigurable in the sense that the set of owners of data can be changed dynamically and concurrently with the ongoing read and write operations.
Url:
DOI: 10.1007/3-540-37795-6_13
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003500
- to stream Istex, to step Curation: 003458
- to stream Istex, to step Checkpoint: 001A77
- to stream Main, to step Merge: 007E66
- to stream Main, to step Curation: 007A87
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Communication and Data Sharing for Dynamic Distributed Systems</title><author><name sortKey="Lynch, Nancy" sort="Lynch, Nancy" uniqKey="Lynch N" first="Nancy" last="Lynch">Nancy Lynch</name></author><author><name sortKey="Shvartsman, Alex" sort="Shvartsman, Alex" uniqKey="Shvartsman A" first="Alex" last="Shvartsman">Alex Shvartsman</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:DE45F773CC324CEB6DB4C58CF6E44BBE44F6DB39</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/3-540-37795-6_13</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-B7KNB0GC-Q/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003500</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003500</idno><idno type="wicri:Area/Istex/Curation">003458</idno><idno type="wicri:Area/Istex/Checkpoint">001A77</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001A77</idno><idno type="wicri:doubleKey">0302-9743:2003:Lynch N:communication:and:data</idno><idno type="wicri:Area/Main/Merge">007E66</idno><idno type="wicri:Area/Main/Curation">007A87</idno><idno type="wicri:Area/Main/Exploration">007A87</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Communication and Data Sharing for Dynamic Distributed Systems</title><author><name sortKey="Lynch, Nancy" sort="Lynch, Nancy" uniqKey="Lynch N" first="Nancy" last="Lynch">Nancy Lynch</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Laboratory for Computer Science, Massachusetts Institute of Technology, 200 Technology Square, NE43-365, 02139, Cambridge, MA</wicri:regionArea><placeName><region type="state">Massachusetts</region></placeName></affiliation></author><author><name sortKey="Shvartsman, Alex" sort="Shvartsman, Alex" uniqKey="Shvartsman A" first="Alex" last="Shvartsman">Alex Shvartsman</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Department of Computer Science and Engineering, University of Connecticut, 191 Auditorium Road, Unit 3155, 06269, Storrs, CT</wicri:regionArea><placeName><region type="state">Connecticut</region></placeName></affiliation><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Laboratory for Computer Science, Massachusetts Institute of Technology, 200 Technology Square, NE43-365, 02139, Cambridge, MA</wicri:regionArea><placeName><region type="state">Massachusetts</region></placeName></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: This research direction aims to develop and analyze algorithms to solve problems of communication and data sharing in highly dynamic distributed environments. The term dynamic here encompasses many types of changes, including changing network topology, processor mobility, changing sets of participating client processes, a wide range of types of processor and network failures, and timing variations. Constructing distributed applications for such environments is a difficult programming problem. In practice, considerable effort is required to make applications resilient to changes in client requirements and to evolution of the underlying computing medium. We focus our work on distributed services that provide useful guarantees and that make the construction of sophisticated distributed applications easier. The properties we study include ordering and reliability guarantees for communication and coherence guarantees for data sharing. To describe inherent limitations on what problems can be solved, and at what cost, the algorithmic results will be accompanied by lower bound and impossibility results. One example of our approach is the new dynamic atomic shared-memory service for message-passing systems. We formally specified the service and developed algorithms implementing the service. A system implementation is under development. The service is reconfigurable in the sense that the set of owners of data can be changed dynamically and concurrently with the ongoing read and write operations.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Connecticut</li><li>Massachusetts</li></region></list><tree><country name="États-Unis"><region name="Massachusetts"><name sortKey="Lynch, Nancy" sort="Lynch, Nancy" uniqKey="Lynch N" first="Nancy" last="Lynch">Nancy Lynch</name></region><name sortKey="Shvartsman, Alex" sort="Shvartsman, Alex" uniqKey="Shvartsman A" first="Alex" last="Shvartsman">Alex Shvartsman</name><name sortKey="Shvartsman, Alex" sort="Shvartsman, Alex" uniqKey="Shvartsman A" first="Alex" last="Shvartsman">Alex Shvartsman</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 007A87 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 007A87 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:DE45F773CC324CEB6DB4C58CF6E44BBE44F6DB39
|texte= Communication and Data Sharing for Dynamic Distributed Systems
}}
| This area was generated with Dilib version V0.6.33. |  |